From $LL$-regular to $LL(1)$ grammars : transformations, covers and parsing

From LL-Regular to LL (1) Grammars: Transformations, Covers and Parsing

— In this paper it is shown that it is possible to transform any LL-regular grammar G into an LL{\) grammar G' in such a way that parsing G' is as good as parsing G. That ist a par se of a sentence of grammar G can be obtained with a simple string homomorphism from the parse of a corresponding sentence of G'. Since any LL (k) grammar is an LL-regular grammar the results which are obtained are v...

On the Parsing of LL-Regular Grammars

Gap Parsing with LL(1) Grammars

We study the time complexity of the parsing problem for input strings that contain gaps. For context-free languages the time requirement is cubic. For restricted classes of languages given by LL(1), bidirectional LL(1), and a specific kind of XML grammars, the time requirement is bounded linearly or quadratically depending on the number of separate gaps.

The Equivalence Problem for LL - and L / ? - Regular Grammars

The equivalence problem for context-free grammars is “given two arbitrary grammars, do they generate the same language ?” Since this is undecidable in general attention has been restricted to decidable subclasses of the context-free grammars. For example, the classes of U(k) grammars and real-time strict deterministic grammars. In this paper it is shown that the equivalence problem for U-regula...

Context-Free Grammars: Covers, Normal Forms, and Parsing

Let's read! We will often find out this sentence everywhere. When still being a kid, mom used to order us to always read, so did the teacher. Some books are fully read in a week and we need the obligation to support reading. What about now? Do you still love reading? Is reading only for you who have obligation? Absolutely not! We here offer you a new book enPDFd context free grammars covers nor...